Convexity-preserving approximation by univariate cubic splines

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convexity Preserving Approximation by Free Knot Splines

In this paper we study the order of shape preserving approximation of functions f in Sobolev space by free knot splines. The main result is that we can preserve k-convexity of f for general k, and retain the optimal order of approximation n ?r at the same time.

متن کامل

Shape-preserving, multiscale fitting of univariate data by cubic L1 smoothing splines

Bivariate cubic L1 smoothing splines are introduced. The coefficients of a cubic L1 smoothing spline are calculated by minimizing the weighted sum of the L1 norms of second derivatives of the spline and the 1 norm of the residuals of the data-fitting equations. Cubic L1 smoothing splines are compared with conventional cubic smoothing splines based on the L2 and 2 norms. Computational results fo...

متن کامل

Convexity preserving splines over triangulations

A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein–Bézier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.

متن کامل

Univariate Cubic L1 Interpolating Splines: Analytical Results for Linearity, Convexity and Oscillation on 5-PointWindows

We analytically investigate univariate C continuous cubic L1 interpolating splines calculated by minimizing an L1 spline functional based on the second derivative on 5-point windows. Specifically, we link geometric properties of the data points in the windows with linearity, convexity and oscillation properties of the resulting L1 spline. These analytical results provide the basis for a computa...

متن کامل

Convexity preserving interpolation by splines of arbitrary degree

In the present paper an algorithm of C interpolation of discrete set of data is given using splines of arbitrary degree, which preserves the convexity of given set of data. Mathematics Subject Classification 2000: 65D05, 65D07, 41A05, 41A15.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2015

ISSN: 0377-0427

DOI: 10.1016/j.cam.2015.03.051